Rough Computational Approach to UAR based on Dominance Matrix in IOIS

نویسندگان

  • Xiaoyan Zhang
  • Weihua Xu
چکیده

Rough set theory is a new mathematical tool to deal with vagueness and uncertainty. The classical rough set theory based on equivalence relation has made a great progress, while the equivalence relation is too harsh to meet and is extended to dominance relation in real world. It is important to investigate rough computational methods for rough set theory, which is one of the bottleneck problems in the development of rough set theory. In this article, rough computational approach to upper approximation reduction (UAR) is discussed based on dominance matrix in inconsistent ordered information systems (IOIS). The algorithm of upper approximation reduction is obtained, from which we can provide approach to upper approximation reduction operated simply in inconsistent systems based on dominance relations. Finally, an example illustrates the validity of this method, and shows the method is excellent to a complicated information system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation of Class Unions Based on Dominance-Matrix Within Dominance-Based Rough Set Approach

Dominance-based Rough Set Approach (DRSA) is an extension of classical Rough Set Theory (RST). Approximation of class unions is a very important approach in DRSA. Aiming at the disadvantage of the classical method we presented a new methodology for approximation of class unions based on dominance-matrix. It only needs to calculate the dominance-matrix and does not need to consider the preferenc...

متن کامل

A Semantical Approach to Rough Sets and Dominance-Based Rough Sets

There exist two formulations of rough sets: the conceptual and computational one. The conceptual or semantical approach of rough set theory focuses on the meaning and interpretation of concepts, while algorithms to compute those concepts are studied in the computational formulation. However, the research on the former is rather limited. In this paper, we focus on a semantically sound approach o...

متن کامل

A Parallel Matrix-Based Approach for Computing Approximations in Dominance-Based Rough Sets Approach

Dominance-based Rough Sets Approach (DRSA) is a useful tool for multi-criteria classification problems solving. Parallel computing is an efficient way to accelerate problems solving. Computation of approximations is a vital step to find the solutions with rough sets methodologies. In this paper, we propose a matrix-based approach for computing approximations in DRSAand design the corresponding ...

متن کامل

Incremental Versus Non-incremental: Data and Algorithms Based on Ordering Relations

Based on multi-dominance discernibility matrices, a non-incremental algorithm RIDDM and an incremental algorithm INRIDDM are proposed by means of Dominance-based Rough Set Approach. For the incremental algorithm, when a new object arrives, after updating one row or one column in the matrix, we could get the updated rule sets. Time complexity analysis and experimental results show that the incre...

متن کامل

Incremental updating approximations in dominance-based rough sets approach under the variation of the attribute set

Dominance-based Rough Sets Approach (DRSA) is a generalized model of the classical Rough Sets Theory (RST) which may handle information with preference-ordered attribute domain. The attribute set in the information system may evolve over time. Approximations of DRSA used to induce decision rules need updating for knowledge discovery and other related tasks. We firstly introduce a kind of domina...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Intelligent Information Management

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2011